Logical Semantics of Types for Concurrency
نویسنده
چکیده
We motivate and present a logical semantic approach to types for concurrency and to the soundness of related systems. The approach is illustrated by the development of a generic type system for the π-calculus, which may be instantiated for specific notions of typing by extension with adequate subtyping principles. Soundness of our type system is established using a logical predicate technique, based on a compositional spatial logic interpretation of types.
منابع مشابه
A duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملDomain Theory in Logical Form
A metalanguage for denotational semantics is given a logical interpretation: types are interpreted as propositional theories; terms (in an extended typed λ-calculus, denoting elements of types) are embedded in an endogenous program logic, which characterises their behaviour in terms of which properties they satisfy; terms (in an extension of the algebraic metalanguage of cartesian closed catego...
متن کاملThe Expressive Power of Transitive Closue and 2-way Multihead Automata
Correctness proof for the WAM with types p. 15 Model checking of persistent Petri nets p. 35 Provability in TBLL: A decision procedure p. 53 How to implement first order formulas in local memory machine models p. 68 A new approach to abstract data types II. Computation on ADTs as ordinary computation p. 79 A primitive recursive set theory and AFA: On the logical complexity of the largest bisimu...
متن کاملMultiple Granularity Locks for the KBMS Environment
As ever-larger knowledge bases (KBs) are being built, knowledge sharing becomes an aspect of paramount importance in Knowledge Base Management Systems (KBMSs). In this paper, we propose a way of controlling knowledge sharing by means of the LARS (Locks using Abstraction Relationships’ Semantics) approach for concurrency control in KBs. LARS synchronizes transactions through many different granu...
متن کاملDomain Theory and the Logic of Observable Properties
The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of prog...
متن کامل